Metaheuristic Algorithms: Optimal Balance of Intensification and Diversification

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Metaheuristic Algorithms: Optimal Balance of Intensification and Diversification

In nature-inspired metaheuristic algorithms, two key components are local intensification and global diversification, and their interaction can significantly affect the efficiency of a metaheuristic algorithm. However, there is no rule for how to balance these important components. In this paper, we provide a first attempt to give some theoretical basis for the optimal balance of exploitation a...

متن کامل

THE EFFECTS OF INITIAL SAMPLING AND PENALTY FUNCTIONS IN OPTIMAL DESIGN OF TRUSSES USING METAHEURISTIC ALGORITHMS

Although Genetic algorithm (GA), Ant colony (AC) and Particle swarm optimization algorithm (PSO) have already been extended to various types of engineering problems, the effects of initial sampling beside constraints in the efficiency of algorithms, is still an interesting field. In this paper we show that, initial sampling with a special series of constraints play an important role in the conv...

متن کامل

Econometrics and Metaheuristic Optimization Approaches to International Portfolio Diversification

Using advanced techniques of econometrics and a metaheuristic optimization approach, this study attempts to evaluate the potential advantages of international portfolio diversification for East Asian international investors when investing in the Middle Eastern emerging markets. Overall, the results of both econometric and the metaheuristic optimization methods are supporting each other. Finding...

متن کامل

Diversification and Intensification in Parallel SAT Solving

In this paper, we explore the two well-known principles of diversification and intensification in portfolio-based parallel SAT solving. These dual concepts play an important role in several search algorithms including local search, and appear to be a key point in modern parallel SAT solvers. To study their tradeoff, we define two roles for the computational units. Some of them classified as Mas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics & Information Sciences

سال: 2014

ISSN: 1935-0090,2325-0399

DOI: 10.12785/amis/080306